computation bound

   A condition in which the speed of operation of the processor actually limits the speed of program execution. The processor is limited by the number of arithmetic operations it can perform.
   See also input/output bound.

Dictionary of networking . 2014.

Look at other dictionaries:

  • input/output bound —    Abbreviated I/O bound. A condition in which the speed of operation of the input/output port limits the speed of program execution. Getting the data into and out of the computer is more time consuming than actually processing that same data.… …   Dictionary of networking

  • Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… …   Wikipedia

  • I/O bound — In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period of time spent waiting for input/output operations to be completed. This is the opposite of a task… …   Wikipedia

  • Parallel computation thesis — In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by a sequential machine. The parallel computation… …   Wikipedia

  • Limits to computation — There are several physical and practical limits to the amount of computation or data storage that can be performed with a given amount of mass, volume, or energy:* The Bekenstein bound limits the amount of information that can be stored within a… …   Wikipedia

  • Continuous quantum computation — Two major motivations for studying continuous quantum computation are: Many scientific problems have continuous mathematical formulations. Examples of such formulations are Path integration Feynman Kac path integration Schrödinger equation In… …   Wikipedia

  • Book on Numbers and Computation — The Suàn shù shū (算數書), or the Book on Numbers and Computation (also as Writings on Reckoning ), [Dauben (2004), 151.] is the earliest known Chinese mathematical treatise. It was written during the early Western Han Dynasty, sometime between 202… …   Wikipedia

  • Riemann hypothesis — The real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011 …   Wikipedia

  • π-calculus — In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) …   Wikipedia

  • Pi-calculus — In theoretical computer science, the pi calculus is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems). The aim of the …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.